Ranking by outdegree for directed graphs
نویسندگان
چکیده
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108–111). c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
The outflow ranking method for weighted directed graphs
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. This outflow ranking method generalizes the ranking by outdegree for directed graphs. Furthermore, we compare our axioms with other axioms discussed in the literature.
متن کاملApproximating Longest Directed Paths and Cycles
We investigate the hardness of approximating the longest path and the longest cycle in directed graphs on n vertices. We show that neither of these two problems can be polynomial time approximated within n1-ε for any ε > 0 unless P = NP. In particular, the result holds for digraphs of constant bounded outdegree that contain a Hamiltonian cycle. Assuming the stronger complexity conjecture that S...
متن کاملAlgorithms for Büchi Games
The classical algorithm for solving Büchi games requires time O(n ·m) for game graphs with n states and m edges. For game graphs with constant outdegree, the best known algorithm has running time O(n/ log n). We present two new algorithms for Büchi games. First, we give an algorithm that performs at most O(m) more work than the classical algorithm, but runs in time O(n) on infinitely many graph...
متن کاملJudicious partitions of directed graphs
The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In this paper, we study essentially the most fundamental judicious partitioning problem for directed graphs, which naturally extends the classical Max Cut problem ...
متن کاملMaximum Directed Cuts in Graphs with Degree Constraints
The Max Cut problem is an NP-hard problem and has been studied extensively. Alon et al. studied a directed version of the Max Cut problem and observed its connection to the Hall ratio of graphs. They proved, among others, that if an acyclic digraph has m edges and each vertex has indegree or outdegree at most 1, then it has a directed cut of size at least 2m/5. Lehel et al. extended this result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 271 شماره
صفحات -
تاریخ انتشار 2003